On digraphs with circulant adjacency matricesCHONG-YUN CHAO.Archiv der Mathematik. 1980, Vol 54, Num 1, pp 93-104, issn 0003-889XArticle

On uniquely 3-colorable graphsCHONG-YUN CHAO; CHEN, Z.Discrete mathematics. 1993, Vol 112, Num 1-3, pp 21-27, issn 0012-365XArticle

On partitions of functions on finite setsCHONG-YUN CHAO; HONG ZHANG.International journal of computer mathematics. 1990, Vol 32, Num 1-2, pp 39-47, issn 0020-7160Article

ON SOME SETS OF PERMUTATION MATRICESCHONG YUN CHAO.1982; LINEAR ALGEBRA & APPL.; ISSN 0024-3795; USA; DA. 1982; VOL. 45; PP. 131-134; BIBL. 5 REF.Article

A TEST FOR CONJUGACY OF PARTITIONS OF FINITE SETS.CHONG YUN CHAO.1974; J. COMBINATOR. THEORY, A; U.S.A.; DA. 1974; VOL. 17; NO 2; PP. 167-172; BIBL. 1 REF.Article

A NOTE ON LABELED SYMMETRIC GRAPHS.CHONG YUN CHAO.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 8; NO 3; PP. 295-297; BIBL. 7 REF.Article

A CLASS OF VERTEX-TRANSITIVE DIGRAPHSCHONG YUN CHAO; WELLS JG.1973; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1973; VOL. 14; NO 3; PP. 246-255; BIBL. 8 REF.Serial Issue

Chromatic polynomials of connected graphsCHONG-YUN CHAO; LIAN-CHANG ZHAO.Archiv der Mathematik. 1984, Vol 43, Num 2, pp 187-192, issn 0003-889XArticle

On labeled vertex-transitive digraphs with a prime number of verticesCHONG-YUN CHAO; WELLS, J. G.Discrete mathematics. 1983, Vol 46, Num 3, pp 311-315, issn 0012-365XArticle

ON CHROMATIC EQUIVALENCE OF GRAPHS.CHONG YUN CHAO; WHITEHEAD EG JR.1978; LECTURE NOTES MATH.; GERM.; DA. 1978; NO 642; PP. 121-131; BIBL. 12 REF.; (THEORY APPL. GRAPHS. INT. CONF. PROC.; KALAMAZOO; 1976)Conference Paper

CHROMATICITY OF SELF-COMPLEMENTARY GRAPHSCHONG YUN CHAO; WHITEHEAD EG JR.1979; ARCH. MATH.; DEU; DA. 1979; VOL. 32; NO 3; PP. 295-304; BIBL. 4 REF.Article